منابع مشابه
The Hypergraphic Tutte/Nash-Williams Theorem via Integer Decomposition, Total Dual Laminarity, and Power Matroids
We reprove the hypergraphic generalization of the Tutte/Nash-Williams theorem, which gives sufficient conditions for a hypergraph to contain k disjoint connected hypergraphs. First we observe the theorem is equivalent to the natural LP relaxation having the integer decomposition property. Then we give a new proof of this property using LP uncrossing methods. We discover that “total dual laminar...
متن کاملLehman / s Switching Tutte and Game and a Theorem of Nash - Williams l Jack Edmonds
The results c ited in the title are unifi ed by th e following theore m: For a ny matroid M a nd any subse ts Nand K of e le me nts in M , there e xi s t as many as k disjoint subsets of N which span K a nd which spa n each ot he r if and only if the re is no contraction matroid M X A where NnA partitions int o as few as k se ts such th at eac h is independen t in M X A and suc h that at least ...
متن کاملGraph minors XXIII. Nash-Williams' immersion conjecture
We define a quasi-order of the class of all finite hypergraphs, and prove it is a well-quasi-order. This has two corollaries of interest: • Wagner’s conjecture, proved in a previous paper, states that for every infinite set of finite graphs, one of its members is a minor of another. The present result implies the same conclusion even if the vertices or edges of the graphs are labelled from a we...
متن کاملOn the Nash-Williams' Lemma in Graph Reconstruction Theory
A generalization of Nash-Williams' lemma is proved for the structure of m-uniform null (m − k)-designs. It is then applied to various graph reconstruction problems. A short combinatorial proof of the edge reconstructibility of digraphs having regular underlying undirected graphs (e.g. tournaments) is given. A type of Nash-Williams' lemma is conjectured for the vertex reconstruction problem.
متن کاملThe Rabinowitsch-Mollin-Williams Theorem Revisited
We completely classify all polynomials of type x2 x− Δ−1 /4 which are prime or 1 for a range of consecutive integers x ≥ 0, called Rabinowitsch polynomials, where Δ ≡ 1 mod4 with Δ > 1 square-free. This corrects, extends, and completes the results by Byeon and Stark 2002, 2003 via the use of an updated version of what Andrew Granville has dubbed the Rabinowitsch-MollinWilliams Theorem—by Granvi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Combinatorica
سال: 2016
ISSN: 0209-9683,1439-6912
DOI: 10.1007/s00493-016-3424-8